Matrix cyclization over complex polynomials
نویسندگان
چکیده
منابع مشابه
Characteristic Polynomials of Complex Random Matrix Models
We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written in terms of a determinant containing these polynomials and their kernel. It generalizes the known expression for hermitian matrices and it also provides a g...
متن کاملFactoring Rational Polynomials Over the Complex Numbers
NC algorithms are given for determining the number and degrees of the factors, irreducible over the complex numbers C, of a multivariate polynomial with rational coeÆcients and for approximating each irreducible factor. NC is the class of functions computable by logspace-uniform boolean circuits of polynomial size and polylogarithmic depth. The measures of size of the input polynomial are its d...
متن کاملHigher numerical ranges of matrix polynomials
Let $P(lambda)$ be an $n$-square complex matrix polynomial, and $1 leq k leq n$ be a positive integer. In this paper, some algebraic and geometrical properties of the $k$-numerical range of $P(lambda)$ are investigated. In particular, the relationship between the $k$-numerical range of $P(lambda)$ and the $k$-numerical range of its companion linearization is stated. Moreover, the $k$-numerical...
متن کاملGeneralized numerical ranges of matrix polynomials
In this paper, we introduce the notions of C-numerical range and C-spectrum of matrix polynomials. Some algebraic and geometrical properties are investigated. We also study the relationship between the C-numerical range of a matrix polynomial and the joint C-numerical range of its coefficients.
متن کاملMinimizing trigonometric matrix polynomials over semi-algebraic sets
This paper addresses the problem of minimizing the minimum eigenvalue of a trigonometric matrix polynomial. The contribution is to show that, by exploiting Putinar’s Positivstellensatz and introducing suitable transformations, it is possible to derive a nonconservative approach based on semidefinite programming (SDP) whose computational burden can be significantly smaller than that of an existi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1998
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(97)10030-1